Heuristic Function Evaluation Framework
نویسندگان
چکیده
We propose a paradigm for evaluating game heuristic functions in which we define a set of metrics, each measuring an aspect of heuristic’s performance, and use them to evaluate the heuristic function by comparing the function’s output against a pre-computed benchmark containing a set of states from a game and ground-truth values of each of their moves. The advantage of our approach is that it is fast (once the benchmark is computed) and focused on specific user-defined questions. While the ideal benchmark dataset would have minimax action values, these values can sometimes be too difficult to obtain, so we investigate the possibility of generating datasets using the MCTS algorithm. We compare the performance of MCTS datasets for Connect Four to the game-theorical one, and identify a set of metric which can be reliably used with the MCTS dataset. Finally, we present two case studies, in which we show how our framework can be used to gain better understanding of a heuristic function’s behavior. Kynning á Rammaaðferð til að Meta Brjóstvitsaðferðir
منابع مشابه
A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملEvaluation-Function Based Proof-Number Search
This article introduces Evaluation-Function based Proof– Number Search (EF-PN) and its second-level variant EF-PN. It is a framework for setting the proof and disproof number of a leaf node with a heuristic evaluation function. Experiments in LOA and Surakarta show that compared to PN and PN, which use mobility to initialize the proof and disproof numbers, EF-PN and EF-PN take between 45% to 85...
متن کاملState-set branching: Leveraging BDDs for heuristic search
In this article, we present a framework called state-set branching that combines symbolic search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search, such as A* and greedy best-first search. The framework relies on an extension of these algorithms from expanding a single state in each iteration to expanding a set of states. We prove that it is generally sound and opt...
متن کاملMeta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملAn Effective Framework for Chinese Syntactic Parsing
This paper presents an effective framework for Chinese syntactic parsing, which includes two parts. The first one is a parsing framework, which is based on an improved bottom-up chart parsing algorithm, and integrates the idea of the beam search strategy of N best algorithm and heuristic function of A* algorithm for pruning, then get multiple parsing trees. The second is a novel evaluation mode...
متن کاملA Hyper-Heuristic Framework for Agent-Based Crowd Modeling and Simulation: (Extended Abstract)
This paper proposes a hyper-heuristic crowd modeling framework to generate realistic crowd dynamics that can match video data. In the proposed framework, motions of agents are driven by a high-level heuristic (HH) which intelligently selects way-points for agents based on the current situations. Three low-level heuristics are defined and used as building blocks of the HH. Based on the newly def...
متن کامل